Step of Proof: decidable_wf
9,38
postcript
pdf
Inference at
*
I
of proof for Lemma
decidable
wf
:
A
:
. Dec(
A
)
latex
by ((Unfold `decidable` 0)
CollapseTHEN ((Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat
C
3:n)) (first_tok :t) inil_term)))
latex
C
.
Definitions
P
Q
,
Dec(
P
)
,
t
T
,
,
x
:
A
.
B
(
x
)
Lemmas
not
wf
origin